Parallel Ant Colonies for Combinatorial Optimization Problems
نویسندگان
چکیده
Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem (QAP). Parallelism demonstrates that cooperation between communicating agents improve the obtained results in solving the QAP. It demonstrates also that high-performance computing is feasible to solve large optimization problems.
منابع مشابه
Strategies for the Parallel Implementation of Metaheuristics∗
Parallel implementations of metaheuristics appear quite naturally as an effective alternative to speed up the search for approximate solutions of combinatorial optimization problems. They not only allow solving larger problems or finding improved solutions with respect to their sequential counterparts, but they also lead to more robust algorithms. We review some trends in parallel computing and...
متن کاملSolving Symmetric and Asymmetric TSPs by Ant Colonies
In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We apply ACS to both symmetric and asymmetric traveling salesman problems. Results show that ACS is able to find good solutions to these problems.
متن کاملA Hybrid Ant Colony Algorithm for Quadratic Assignment Problem
Quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in many fields. Many real world applications such as backboard wiring, typewriter keyboard design and scheduling can be formulated as QAPs. Ant colony algorithm is a multi-agent system inspired by behaviors of real ant colonies to solve optimization problems. Ant colony optimization (ACO) is one of new ...
متن کاملA General Ant Colony Model to solve Combinatorial Optimization Problems
An Ants System is an artificial system based on the behavior of real ant colonies, which is used to solve combinatorial problems. This is a distributed algorithm composed by a set of cooperating agents called ants which cooperate among them to find good solutions to combinatorial optimization problems. The cooperation follows the behavior of real ants using an indirect form of communication med...
متن کاملUsing Competing Ant Colonies to Solve k-way Partitioning Problems with Foraging and Raiding Strategies
The self organizing properties of ant colonies are employed to tackle the classical combinatorial optimization problem of graph partitioning. The graph is mapped onto an artificial environment in a manner that preserves the structural information. Ants from a number of colonies compete for resources. This leads to a restructuring of the global environment corresponding to a good partition. On t...
متن کامل